Two invariants for adjointly equivalent graphs

نویسندگان

  • Feng Ming Dong
  • Kee L. Teo
  • Charles H. C. Little
  • Michael D. Hendy
چکیده

Two graphs are defined to be adjointly equivalent if their complements are chromatically equivalent. We study the properties of two invariants under adjoint equivalence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On problems and conjectures on adjointly equivalent graphs

For a graph G, let h(G, x) denote its adjoint polynomial and (G) denote the minimum real root of h(G, x). Two graphs H and G are said to be adjointly equivalent if h(H, x) = h(G, x). Let F1 = {G| (G)>− 4} andF2 = {G| (G) − 4}. In this paper, we give a necessary and sufficient condition for two graphs H and G in Fi to be adjointly equivalent, where i = 1, 2. We also solve some problems and conje...

متن کامل

Splice Graphs and their Vertex-Degree-Based Invariants

Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

Applications of some Graph Operations in Computing some Invariants of Chemical Graphs

In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.

متن کامل

Product version of reciprocal degree distance of composite graphs

A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.

متن کامل

Microsoft Word - SD Mixtlinear2.docx

In [1] we introduced the mixt-linear circles adjointly inscribed associated to a triangle, with emphasizes on some of their properties. Also, we’ve mentioned about mixt-linear circles adjointly ex-inscribed associated to a triangle. In this article we’ll show several basic properties of the mixt-linear circles adjointly exinscribed associate to a triangle. Definition 1 We define a mixt-linear c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2002